Deadlock avoidance for production systems with flexible routing
نویسنده
چکیده
Avoiding deadlock is essential in the operation of highly automated manufacturing systems. Many of these systems support sufficient redundancy to permit flexible part routing. Although flexible routing improves the inherent operational flexibility of these systems, it also requires more highly sophisticated supervisory control techniques. The objective of this work is to characterize the deadlock avoidance problem for systems with flexible routing capabilities. Specifically, the paper addresses deadlock avoidance for single capacity systems (each machine has a single unit of buffer capacity), and mixed capacity systems (some machines have multiple units of buffer capacity). For each of these, we characterize deadlock and prove the correctness of several methods of suboptimal deadlock avoidance. We also address two interesting special cases. The first assumes that every stage of every part type can be performed on at least one multiple capacity machine, whereas the second provides a finite central buffer that can be revisited after every processing stage. For the first case, we present two suboptimal deadlock avoidance approaches, while for the second, we show optimal deadlock avoidance to be computationally tractable.
منابع مشابه
An Optimal Deadlock Avoidance Policy for Manufacturing System with Flexible Operation Sequence and Flexible Routing
This paper addresses the deadlock avoidance problems in manufacturing systems with sequence and route flexibility. It is shown that for a large class of such systems, through one-step look ahead, an optimal deadlock avoidance policy can be obtained. For a general system the authors present a system reduction method by which the system is reduced and the reduced system has an optimal deadlock av...
متن کاملDeadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
This paper considers the deadlock avoidance problem for the class of conjunctive / disjunctive (sequential) resource allocation systems (C/D-RAS), which allows for multiple resource acquisitions and flexible routings. A new siphon-based characterization of deadlocks arising in C/D-RAS is developed, and subsequently, this characterization facilitates the development of a polynomial-complexity de...
متن کاملOn-line Deadlock Avoidance for Complex Routing Flexible Manufacturing Cells
The time for electronically connecting business and manufacturing has come. Advancements in e-commerce have requested that business decisions on web be the direct driving info to the corresponding manufacturing activities without human interventions. Since orders from the web may arrive in random sequence and with a range of specifications, flexible manufacturing systems (FMS) may be the proper...
متن کاملA Polynomial-Complexity Deadlock Avoidance Policy for Sequential Resource Allocation Systems with Multiple Resource Acquisitions and Flexible Routings
The need for effective and efficient deadlock avoidance policies (DAP’s) is ever increasing due to the higher demand for system automation. This paper considers the deadlock avoidance problem for the class of Conjunctive/Disjunctive (sequential) resource allocation systems (C/D-RAS), in which multiple resource acquisitions and flexible routings are allowed. A new siphon-based characterization o...
متن کاملNo More Deadlocks - Applying The Time Window Routing Method To Shuttle Systems
Autonomous vehicle-based storage and retrieval systems are used in order to supply picking or production areas based on the goods-to-person principle. In one such system, several vehicles move within the same rail system. Hence, routing and deadlock handling is an important issue that has to be resolved carefully to run these systems efficiently and robustly. One possibility for coping with dea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Robotics and Automation
دوره 15 شماره
صفحات -
تاریخ انتشار 1999